Conservative cross diffusions and pattern formation through relaxation
نویسندگان
چکیده
منابع مشابه
Conservative cross diffusions and pattern formation through relaxation
This paper is aimed at studying the formation of patches in a cross-diffusion system without reaction terms when the diffusion matrix can be negative but with positive self-diffusion. We prove existence results for small data and global a priori bounds in space-time Lebesgue spaces for a large class of ’diffusion’ matrices. This result indicates that blow-up should occur on the gradient. One ca...
متن کاملPerthame. Conservative cross diffusions and pattern formation through
Models of self-organizing bacterial communities and comparisons with experimental observations. dynamics with size dependency–strain phenomena. [4] Benoˆıt Perthame. Why hyperbolic and kinetic models for cell populations self-organization? In Hyperbolic problems: theory, numerics and applications , volume 67 of Proc. The non-local Fisher-KPP equation: travelling waves and steady states. [8] Phi...
متن کاملSharp decay rates for the fastest conservative diffusions
In many diffusive settings, initial disturbances will gradually disappear and all but their crudest features — such as size and location — will eventually be forgotten. Quantifying the rate at which this information is lost is sometimes a question of central interest. Here this rate is addressed for the fastest conservative nonlinearities in the singular diffusion equation ut = (u), (n− 2)+/n <...
متن کاملCross-diffusion and pattern formation in reaction-diffusion systems.
Cross-diffusion, the phenomenon in which a gradient in the concentration of one species induces a flux of another chemical species, has generally been neglected in the study of reaction-diffusion systems. We summarize experiments that demonstrate that cross-diffusion coefficients can be quite significant, even exceeding "normal," diagonal diffusion coefficients in magnitude in systems that invo...
متن کاملTree Pattern Relaxation
Tree patterns are fundamental to querying tree structured data like XML Because of the heterogeneity of XML data it is often more appropriate to permit approximate query matching and return ranked answers in the spirit of Information Retrieval than to return exact matches In this paper we study the problem of approximate XML query matching based on tree pattern relaxations and devise e cient al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal de Mathématiques Pures et Appliquées
سال: 2009
ISSN: 0021-7824
DOI: 10.1016/j.matpur.2009.05.003